Parallel population-based algorithm portfolios: An empirical study
نویسندگان
چکیده
منابع مشابه
Empirical Study of Population Diversity in Permutation-Based Genetic Algorithm
This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Salesman Problems and Vehicle Routing Problems. Maintenance of diversity adaptive control is one of the most fundamental issues of Genetic Algorithm (GA). We are concerned in this paper with GA in which individual chromosomes are ...
متن کاملLearning Algorithm Portfolios for Parallel Execution
Portfolio-based solvers are both effective and robust, but their promise for parallel execution with constraint satisfaction solvers has received relatively little attention. This paper proposes an approach that constructs algorithm portfolios intended for parallel execution based on a combination of case-based reasoning, a greedy algorithm, and three heuristics. Empirical results show that thi...
متن کاملAutomatic construction of parallel portfolios via algorithm configuration
Since 2004, increases in computational power described by Moore’s law have substantially been realized in the form of additional cores rather than through faster clock speeds. To make effective use of modern hardware when solving hard computational problems, it is therefore necessary to employ parallel solution strategies. In this work, we demonstrate how effective parallel solvers for proposit...
متن کاملTransformation-based Feature Computation for Algorithm Portfolios
Instance-specific algorithm configuration and algorithm portfolios have been shown to offer significant improvements over single algorithm approaches in a variety of application domains. In the sat and csp domains algorithm portfolios have consistently dominated the main competitions in these fields for the past five years. For a portfolio approach to be effective there are two crucial conditio...
متن کاملNon-Model-Based Algorithm Portfolios for SAT
When tackling a computationally challenging combinatorial problem, one often observes that some solution approaches work well on some instances, while other approaches work better on other instances. This observation has given rise to the idea of building algorithm portfolios [5]. Leyton-Brown et al. [1], for instance, proposed to select one of the algorithms in the portfolio based on some feat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2017
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2017.03.061